Cryptography using Chebyshev polynomials
نویسنده
چکیده
We consider replacing the monomial xn with the Chebyshev polynomial Tn(x) in the Diffie-Hellman and RSA cryptography algorithms. We show that we can generalize the binary powering algorithm to compute Chebyshev polynomials, and that the inverse problem of computing the degree n, the discrete log problem for Tn(x) mod p, is as difficult as that for xn mod p.
منابع مشابه
Blind Signature Scheme Based on Chebyshev Polynomials
A blind signature scheme is a cryptographic protocol to obtain a valid signature for a message from a signer such that signer’s view of the protocol can’t be linked to the resulting message signature pair. This paper presents blind signature scheme using Chebyshev polynomials. The security of the given scheme depends upon the intractability of the integer factorization problem and discrete loga...
متن کاملQRKE: Extensions
Permutable Chebyshev polynomials (T polynomials) defined over the field of real numbers are suitable for creating a Diffie-Hellman-like key exchange algorithm that is able to withstand attacks using quantum computers. The algorithm takes advantage of the commutative properties of Chebyshev polynomials of the first kind. We show how T polynomial values can be computed faster and how the underlyi...
متن کاملSolving singular integral equations by using orthogonal polynomials
In this paper, a special technique is studied by using the orthogonal Chebyshev polynomials to get approximate solutions for singular and hyper-singular integral equations of the first kind. A singular integral equation is converted to a system of algebraic equations based on using special properties of Chebyshev series. The error bounds are also stated for the regular part of approximate solut...
متن کاملSolving Differential Equations by Using a Combination of the First Kind Chebyshev Polynomials and Adomian Decomposition Method
In this paper, we are going to solve a class of ordinary differential equations that its source term are rational functions. We obtain the best approximation of source term by Chebyshev polynomials of the first kind, then we solve the ordinary differential equations by using the Adomian decomposition method
متن کاملPost-buckling response of thin composite plates under end-shortening strain using Chebyshev techniques
In this paper, a method based on Chebyshev polynomials is developed for examination of geometrically nonlinear behaviour of thin rectangular composite laminated plates under end-shortening strain. Different boundary conditions and lay-up configurations are investigated and classical laminated plate theory is used for developing the equilibrium equations. The equilibrium equations are solved dir...
متن کامل